778 research outputs found

    Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests

    Get PDF
    We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea consists in computing a bisimulation by exploring reachable pairs symbolically, so as to avoid redundancies. This idea can be combined with already existing optimisations, and we show in particular a nice integration with the disjoint sets forest data-structure from Hopcroft and Karp's standard algorithm. Then we consider Kleene algebra with tests (KAT), an algebraic theory that can be used for verification in various domains ranging from compiler optimisation to network programming analysis. This theory is decidable by reduction to language equivalence of automata on guarded strings, a particular kind of automata that have exponentially large alphabets. We propose several methods allowing to construct symbolic automata out of KAT expressions, based either on Brzozowski's derivatives or standard automata constructions. All in all, this results in efficient algorithms for deciding equivalence of KAT expressions

    Subtyping constraints in quasi-lattices

    Get PDF
    In this report, we show the decidability and NP-completeness of the satisfiability problem for non-structural subtyping constraints in quasi-lattices. This problem, first introduced by Smolka in 1989, is important for the typing of logic and functional languages. The decidability result is obtained by generalizing Trifonov and Smith's algorithm over lattices, to the case of quasi-lattices. Similarly, we extend Pottier's algorithm for computing explicit solutions to the case of quasi-lattices. Finally we evoke some applications of these results to type inference in constraint logic programming and functional programming languages

    Affine convex body semigroups

    Full text link
    In this paper we present a new kind of semigroups called convex body semigroups which are generated by convex bodies of R^k. They generalize to arbitrary dimension the concept of proportionally modular numerical semigroup of [7]. Several properties of these semigroups are proven. Affine convex body semigroups obtained from circles and polygons of R^2 are characterized. The algorithms for computing minimal system of generators of these semigroups are given. We provide the implementation of some of them

    Polymorphism, subtyping, and type inference in MLsub

    Get PDF
    We present a type system combining subtyping and ML-style parametric polymorphism. Unlike previous work, our system support type inference and has compact principal types. We demonstrate this system in the minimal language MLsub, which types a strict superset of core ML programs. This is made possible by keeping a strict separation between the types used to describe inputs and those used to describe outputs, and extending the classical unification algorithm to handle subtyping constraints between these input and output types. Principal types are kept compact by type simplification, which exploits deep connections between subtyping and the algebra of regular languages. An implementation is available online

    Nominal Logic Programming

    Full text link
    Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates logic programming based on nominal logic. We describe some typical nominal logic programs, and develop the model-theoretic, proof-theoretic, and operational semantics of such programs. Besides being of interest for ensuring the correct behavior of implementations, these results provide a rigorous foundation for techniques for analysis and reasoning about nominal logic programs, as we illustrate via examples.Comment: 46 pages; 19 page appendix; 13 figures. Revised journal submission as of July 23, 200

    Internal convection in thermoelectric generator models

    Full text link
    Coupling between heat and electrical currents is at the heart of thermoelectric processes. From a thermal viewpoint this may be seen as an additional thermal flux linked to the appearance of electrical current in a given thermoelectric system. Since this additional flux is associated to the global displacement of charge carriers in the system, it can be qualified as convective in opposition to the conductive part associated with both phonons transport and heat transport by electrons under open circuit condition, as, e.g., in the Wiedemann-Franz relation. In this article we demonstrate that considering the convective part of the thermal flux allows both new insight into the thermoelectric energy conversion and the derivation of the maximum power condition for generators with realistic thermal coupling.Comment: 8 pages, 3 figure

    A certifying frontend for (sub)polyhedral abstract domains

    No full text
    Convex polyhedra provide a relational abstraction of numerical properties for static analysis of programs by abstract interpretation. We describe a lightweight certification of polyhedral abstract domains using the Coq proof assistant. Our approach consists in delegating most computations to an untrusted backend and in checking its outputs with a certified frontend. The backend is free to implement relaxations of domain operators in order to trade some precision for more efficiency, but must produce hints about the soundness of its results. Experiments with a full-precision backend show that the certification overhead is small and that the certified abstract domain has comparable performance to non-certifying state-of-the-art implementations

    Effects of oil and natural or synthetic vitamin E on ruminal and milk fatty acid profiles in cows receiving a high-starch diet

    Get PDF
    Among trans fatty acids, trans-10,cis-12 CLA has negative effects on cow milk fat production and can affect human health. In high-yielding dairy cows, a shift from the trans-11 to the trans-10 pathway of biohydrogenation (BH) can occur in the rumen of cows receiving high-concentrate diets, especially when the diet is supplemented with unsaturated fat sources. In some but not all experiments, vitamin E has been shown to control this shift. To ascertain the effects of vitamin E on this shift of BH pathway, 2 studies were conducted. The first study explored in vitro the effects of addition of natural (RRR-α-tocopherol acetate) and synthetic (dl-α-tocopherol acetate) vitamin E. Compared with control and synthetic vitamin E, the natural form resulted in a greater trans-10/trans-11 ratio; however, the effect was very low, suggesting that vitamin E was neither a limiting factor for rumen BH nor a modulator of the BH pathway. An in vivo study investigated the effect of natural vitamin E (RRR-α-tocopherol) on this shift and subsequent milk fat depression. Six rumenfistulated lactating Holstein cows were assigned to a 2 × 2 crossover design. Cows received 20-kg DM of a control diet based on corn silage with 22% of wheat, and after 2 wk of adaptation, the diet was supplemented with 600 g of sunflower oil for 2 more weeks. During the last week of this 4-wk experimental period, cows were divided into 2 groups: an unsupplemented control group and a group receiving 11 g of RRR-α-tocopherol acetate per day. A trans-10 shift of ruminal BH associated with milk fat depression due to oil supplementation of a high-wheat diet was observed, but vitamin E supplementation of dairy cows did not result in a reversal toward a trans-11 BH pathway, and did not restore milk fat content
    • …
    corecore